package training.动态规划;

public class 最长子序列 {


    public static void main(String[] args) {


    }


    public static int longestCommonSeq(String s1, String s2) {


        int[][] dp = new int[s1.length()][s2.length()];





        return dp[s1.length() - 1][s2.length() - 1];

    }
}
